Rescheduling in job-shop problems for sustainable manufacturing systems
نویسندگان
چکیده
منابع مشابه
Partial Order Backtracking Based Job Shop Rescheduling
We present here a discipline for job shop rescheduling based on partial order backtracking. We show that partial order backtracking ooers the rescheduler a framework for schedule repair, based upon a set of nogoods, which impose a systematic partial order on the set of activities to be repaired but allows non systematic techniques to be used within that framework. We present rescheduling as par...
متن کاملInvestigating a Hybrid Metaheuristic for Job Shop Rescheduling
Previous research has shown that artificial immune systems can be used to produce robust schedules in a manufacturing environment. The main goal is to develop building blocks (antibodies) of partial schedules that can be used to construct backup solutions (antigens) when disturbances occur during production. The building blocks are created based upon underpinning ideas from artificial immune sy...
متن کاملInvestigating Artificial Immune Systems For Job Shop Rescheduling In Changing Environments
Artificial immune system can be used to generate schedules in changing environments and it has been proven to be more robust than schedules developed using a genetic algorithm. Good schedules can be produced especially when the number of the antigens is increased. However, an increase in the range of the antigens had somehow affected the fitness of the immune system. In this research, we are tr...
متن کاملFlexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملApproximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The problem is to assign operations to machines and to order the operations on the machines so that the operations can be processed in the smallest amount of time. This models a wide variety of problems encountered in real ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cleaner Production
سال: 2017
ISSN: 0959-6526
DOI: 10.1016/j.jclepro.2016.11.002